Reasoning about Anonymous Resources and Meta Statements on the Semantic Web

نویسندگان

  • Guizhen Yang
  • Michael Kifer
چکیده

Anonymous resources and meta statements are two of the more interesting features of RDF — an emerging standard for representing semantic information on the Web. Ironically, when RDF was standardized by W3C over three years ago [24], it came without a semantics. There is now growing understanding that a Semantic Web language without a semantics is an oxymoron, and a number of efforts are directed towards giving RDF a precise semantics [17,15,11]. In this paper we propose a simple semantics for anonymous resources and meta statements in F-logic [23] — a frame-based logic language, which is a popular formalism for representing and reasoning about semantic information on the Web [29,14,16,13,12]. The choice of F-logic (over RDF) as a basis for our semantics is motivated by the fact that F-logic provides a comprehensive solution for the problem of integrating frames, rules, inheritance, and deduction, and it has been shown to provide an effective inference service for RDF [13,28].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Meta-logical Approach for Reasoning with Ontologies and Rules Expressed In OWL 2 VISIT HIRANKITTI and TRANG

OWL is a decidable language for representing ontologies, it adds considerable expressive power to the Semantic Web. However, it has several shortcomings in relational expressivity. These limitations can be overcome by extending an OWL ontology with some form of rules. The revision 2 of OWL is much richer than its predecessor with respect to modeling with rules. In this paper we propose a framew...

متن کامل

A Lookup Index for Semantic Web Resources

Finding Semantic Web statements The Semantic Web can be seen as a large knowledge-base of statements about resources, forming an interconnected graph through multiple references to the same resources. But the graphs in the Semantic Web are decentralised: there is not one single knowledge base that contains the graph of statements but instead anyone can contribute statements on his “personal” we...

متن کامل

Reasoning About Temporal Constraints in RDF

Time management is a key feature needed in any query language for web and semistructured data. However, only recently this has been addressed by the Semantic Web community, through the study of temporal extensions to RDF (Resource Description Framework). In this paper we show that the ability of the RDF data model of handling unknown resources by means of blank nodes, naturally yields a rich fr...

متن کامل

On the Semantics of Anonymous Identity and Reification

Reification and anonymous resources are two of the more interesting features of RDF — an emerging standard for representing semantic information on the Web. Ironically, when RDF was standardized by W3C over three years ago [18], it came without a semantics. There is now growing understanding that a Semantic Web language without a semantics is an oxymoron, and a number of efforts are directed to...

متن کامل

Semantics of the PROV Data Model

This document presents a model-theoretic semantics for the PROV data model, viewing PROV-DM statements as atomic formulas in the sense of first-order logic, and viewing the constraints and inferences specified in PROV-CONSTRAINTS as a first-order theory. It is shown that valid PROV instances (in the sense of PROV-CONSTRAINTS) correspond to satisfiable theories. This information may be useful to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Data Semantics

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2003